Computing parallactic refraction for stellar triangulation

Computing Delaunay Triangulation with Imprecise Input Data

The key step in the construction of the Delaunay triangulation of a finite set of planar points is to establish correctly whether a given point of this set is inside or outside the circle determined by any other three points. We address the problem of formulating the in-circle test when the coordinates of the planar points are given only up to a given precision, which is usually the case in pra...

Quantum Computing in Decoherence-Free Subspace Constructed by Triangulation

Computing 2D Constrained Delaunay Triangulation Using Graphics Hardware

This paper presents a novel approach, termed GPU-CDT, to compute the constrained Delaunay triangulation (CDT) for a planar straight line graph (PSLG), consisting of points and edges, using the graphics processing unit (GPU). Although there are many algorithms for constructing the 2D CDT using the CPU, there has been no known prior approach using the parallel computing power of the GPU efficient...

Computing Rigid Components of Pseudo-triangulation Mechanisms in Linear Time

We investigate the problem of detecting rigid components (maximal Laman subgraphs) in a pseudotriangulation mechanism and in arbitrary pointed planar frameworks. For general Laman graphs with some missing edges, it is known that rigid components can be computed in O(n) time. Here we make substantial use of the special geometry of pointed pseudo-triangulation mechanisms to achieve linear time. T...

On Computing the Homology Type of a Triangulation

We analyze an algorithm for computing the homology type of a triangulation. By triangulation we mean a nite simplicial complex; its homology type is given by its homology groups (with integer coeecients). The algorithm could be used in computer-aided design to tell whether two nite-element meshes or B ezier-spline surfaces are of the same \topological type," and whether they can be embedded in ...